Conjunctions of Unate DNF Formulas: Learning and Structure
نویسندگان
چکیده
منابع مشابه
Conjunctions of Unate DNF Formulas: Learning and Structure
A central topic in query learning is to determine which classes of Boolean formulas are e ciently learnable with membership and equivalence queries. We consider the class Rk consisting of conjunctions of k unate DNF formulas. This class generalizes the class of k-clause CNF formulas, and the class of unate DNF formulas, both of which are known to be learnable in polynomial time with membership ...
متن کاملLearning Talagrand DNF Formulas
Consider the following version of Talagrand’s probabilistic construction of a monotone function f : {0, 1} n → {0, 1}. Let f be an n-term monotone DNF formula where each term is selected independently and uniformly at random (with replacement) from the set of all n log n) possible terms of length log(n) over the first log(n) variables. Let us call such a DNF formula a Talagrand DNF formula. Thi...
متن کاملEvaluation of DNF Formulas
We consider the Stochastic Boolean Function Evaluation (SBFE) problem for classes of DNF formulas. The SBFE problem for DNF formulas is a “sequential testing” problem where we need to determine the value of DNF formula on an initially unknown input x = (x1, ..., xn), when there is a cost ci associated with obtaining the value of xi, each xi is equal to 1 with known probability pi, and the xi ar...
متن کاملProper Learning of k-term DNF Formulas from Satisfying Assignments
In certain applications there may only be positive samples available to to learn concepts of a class of interest, and this has to be done properly, i. e. the hypothesis space has to coincide with the concept class, and without false positives, i. e. the hypothesis always has be a subset of the real concept (one-sided error). For the well studied class of k-term DNF formulas it has been known th...
متن کاملOn Learning Random DNF Formulas Under the Uniform Distribution
We study the average-case learnability of DNF formulas in the model of learning from uniformly distributed random examples. We define a natural model of random monotone DNF formulas and give an efficient algorithm which with high probability can learn, for any fixed constant γ > 0, a random t-term monotone DNF for any t = O(n2−γ). We also define a model of random non-monotone DNF and give an ef...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1998
ISSN: 0890-5401
DOI: 10.1006/inco.1997.2684